Complexity of Reasoning over Temporal Data Models
نویسندگان
چکیده
We investigate the computational complexity of reasoning over temporal extensions of conceptual data models. The temporal conceptual models we analyse include the standard UML/EER ISA between entities and relationships, disjointness and covering, cardinality constraints and their refinements, multiplicity and key constraints; in the temporal dimension, we have timestamping, evolution and transition constraints, as well as lifespan cardinalities. We give a nearly comprehensive picture of the impact of these constraints on the complexity of reasoning, which can range from NLOGSPACE to undecidability.
منابع مشابه
Different Task Complexity Factors and Cognitive Individual Differences: The Effects on EFL Writers’ Performance
This study aimed at examining the main and interaction effects of increased intentional reasoning demands, planning time, and also language learning aptitude on syntactic complexity, accuracy, lexical complexity, and fluency (CALF) of 226 EFL learners’ performance on letter writing tasks. The participants were first randomly assigned to three experimental groups to be given a task with differin...
متن کاملA A Cookbook for Temporal Conceptual Data Modelling with Description Logics
We design temporal description logics suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions (ranging from atomic concept inclusions and disjointness to the full Booleans), as well as cardinality constraints and role inclusions. The logics are interpreted over ...
متن کاملComputational Complexity of Point Algebras for Nonlinear Time
E cient reasoning about temporal constraints over nonlinear time models is vital in numerous application areas, such as planning, distributed systems and cooperating agents. We give a total classi cation of tractable classes for the point algebra over partially ordered time and examine one large tractable subclass of the point algebra over branching time.
متن کاملTask Complexity Manipulation and Accuracy in Writing Performance
This study aimed to investigate the impact of task sequencing, along +/- reasoning demands dimension, on writing task performance in terms of accuracy. The study was motivated by Robinson’s Cognition Hypothesis (CH) as well as previous studies investigating the relationships between task complexity and second language production. The participants of the study were 90 intermediate students at t...
متن کاملContext-aware Modeling for Spatio-temporal Data Transmitted from a Wireless Body Sensor Network
Context-aware systems must be interoperable and work across different platforms at any time and in any place. Context data collected from wireless body area networks (WBAN) may be heterogeneous and imperfect, which makes their design and implementation difficult. In this research, we introduce a model which takes the dynamic nature of a context-aware system into consideration. This model is con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010